Combinatorial and computational aspects of graph packing and graph decomposition

Packing and decomposition of combinatorial objects such as graphs, digraphs, and hypergraphs by smaller objects are central problems in combinatorics and combinatorial optimization. Their study combines probabilistic, combinatorial, and algebraic methods. In addition to being among the most fascinating purely combinatorial problems, they are often motivated by algorithmic applications. There are a considerable number of intriguing fundamental problems and results in this area, and the goal of this paper is to survey the state of the art.